Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
zeros → cons(0, zeros)
tail(cons(X, XS)) → XS
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
zeros → cons(0, zeros)
tail(cons(X, XS)) → XS
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
ZEROS → ZEROS
The TRS R consists of the following rules:
zeros → cons(0, zeros)
tail(cons(X, XS)) → XS
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
ZEROS → ZEROS
The TRS R consists of the following rules:
zeros → cons(0, zeros)
tail(cons(X, XS)) → XS
Q is empty.
We have to consider all minimal (P,Q,R)-chains.